On the usage of Lagrangean Relaxation for the convoy movement problem
نویسندگان
چکیده
The problem of routing military convoys between specific origin and destination pairs is known as convoy movement problem (CMP). In this study, we consider an existing mathematical model of CMP and propose a lower bounding procedure based on Lagrangean Relaxation. The robustness of the proposed procedure is evaluated on a variety of test problem instances. Encouraging results are obtained. Journal of the Operational Research Society (2011) 62, 722–728. doi:10.1057/jors.2010.4 Published online 14 April 2010
منابع مشابه
Lagrangean/surrogate relaxation for generalized assignment problems
This work presents Lagrangean/surrogate relaxation to the problem of maximum pro®t assignment of n tasks to m agents (n > m), such that each task is assigned to only one agent subject to capacity constraints on the agents. The Lagrangean/surrogate relaxation combines usual Lagrangean and surrogate relaxations relaxing ®rst a set of constraints in the surrogate way. Then, the Lagrangean relaxati...
متن کاملLagrangean relaxation with clusters and column generation for the manufacturer's pallet loading problem
We consider in this paper a new lagrangean relaxation with clusters for the Manufacturer’s Pallet Loading Problem (MPLP). The relaxation is based on the MPLP formulated as a Maximum Independent Set Problem (MISP) and represented in a conflict graph that can be partitioned in clusters. The edges inter clusters are relaxed in a lagrangean fashion. Computational tests attain the optimality for som...
متن کاملLagrangean Relaxation with Clusters for the Uncapacitated Facility Location Problem
A good strategy for the solution of a large-scale problem is its division into small ones. In this context, this work explores the lagrangean relaxation with clusters (LagClus) that can be applied to combinatorial problems modeled by conflict graphs. By partitioning and removing the edges that connect the clusters of vertices, the conflict graph is divided in subgraphs with the same characteris...
متن کاملParallel Jobs Scheduling with a Specific Due Date: Asemi-definite Relaxation-based Algorithm
This paper considers a different version of the parallel machines scheduling problem in which the parallel jobs simultaneously requirea pre-specifiedjob-dependent number of machines when being processed.This relaxation departs from one of the classic scheduling assumptions. While the analytical conditions can be easily statedfor some simple models, a graph model approach is required when confli...
متن کاملA Hybrid Approach for CPLP with Multicommodity Flow
We consider a capacitated plant location problem with multi-commodity flow on a two-level network including plants and transshipment points. The objective is to locate plants and determine commodities movement while satisfying customers’ demand and minimizing costs. We present a new and effective hybrid method, composed from Lagrangean Relaxation and UB Creating Method to solve the problem. We ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- JORS
دوره 62 شماره
صفحات -
تاریخ انتشار 2011